PLOP-Hashing: A Grid File without Directory

نویسندگان

  • Hans-Peter Kriegel
  • Bernhard Seeger
چکیده

In this paper we consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, we suggest piecewise linear expansions in order to distribute the load more evenly over the pages of the file. The resuiting piecewise linear order preserving hashing scheme (PLOP-Hashing) is then compared to the 2-level grid file which turned out to be the most popular scheme in practical applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extendible Chained Bucket Hashing for Main Memory Databases

The objective of this paper is to develop a high performance hash-based access method for main memory database systems. Chained bucket hashing is known to provide the fastest random access to a static file stored in main memory. For a dynamic file, however, chained bucket hashing is inappropriate because its address space cannot be adapted to the file size without total reorganization. Extendib...

متن کامل

Optimized Implementation of Extendible Hashing to Support Large File System Directory

Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper, we present our own specially optimized implementation of using extendible hashing in cluster file system in order to support large directory.

متن کامل

Multi-Directory Hashing

We present a new dynamic hashing scheme for disk-based databases, called Multi-Directory Hashing (MDH). MDH uses multiple hash directories to access a file. The size of each hash directory grows dynamically with the file size. The advantages of MDH are enhanced concurrency, improved bucket utilization and smaller total directory size than single-directory hashing. The expected utilization of MD...

متن کامل

Scale and Concurrency of GIGA+: File System Directories with Millions of Files

We examine the problem of scalable file system directories, motivated by data-intensive applications requiring millions to billions of small files to be ingested in a single directory at rates of hundreds of thousands of file creates every second. We introduce a POSIX-compliant scalable directory design, GIGA+, that distributes directory entries over a cluster of server nodes. For scalability, ...

متن کامل

The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure

We present a new dynamic hashed file organization that solves most problems associated with the directory of the grid file proposed by Nievergelt et al. Our scheme is a multilevel extension of the grid file that supports multiattribute accesses to the file for exact-match, partialmatch, and range queries as well as graceful expansion and shrinkage of the file in a dynamic environment. This new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988